Detection of Random Targets in Sensor Networks with Applications
نویسندگان
چکیده
This paper considers the detection of random targets modelled by a hidden Markov chain using distributed multiple sensors. The optimization problem is formulated as an optimal stopping problem which intends to increase the capturing probability of the moving object. The general formulation in this paper may be applied for distributed (change or failure) detection in a networked system, which generalizes the traditional quickest detection. Copyright c ©2005 IFAC
منابع مشابه
Securing Cluster-heads in Wireless Sensor Networks by a Hybrid Intrusion Detection System Based on Data Mining
Cluster-based Wireless Sensor Network (CWSN) is a kind of WSNs that because of avoiding long distance communications, preserve the energy of nodes and so is attractive for related applications. The criticality of most applications of WSNs and also their unattended nature, makes sensor nodes often susceptible to many types of attacks. Based on this fact, it is clear that cluster heads (CHs) are ...
متن کاملA Lightweight Intrusion Detection System Based on Specifications to Improve Security in Wireless Sensor Networks
Due to the prevalence of Wireless Sensor Networks (WSNs) in the many mission-critical applications such as military areas, security has been considered as one of the essential parameters in Quality of Service (QoS), and Intrusion Detection System (IDS) is considered as a fundamental requirement for security in these networks. This paper presents a lightweight Intrusion Detection System to prote...
متن کاملRandom Key Pre-Distribution Techniques against Sybil Attacks
Sybil attacks pose a serious threat for Wireless Sensor Networks (WSN) security. They can create problems in routing, voting schemes, decision making, distributed storage and sensor re-programming. In a Sybil attack, the attacker masquerades as multiple sensor identities that are actually controlled by one or a few existing attacker nodes. Sybil identities are fabricated out of stolen keys, obt...
متن کاملA Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks
Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...
متن کاملFDMG: Fault detection method by using genetic algorithm in clustered wireless sensor networks
Wireless sensor networks (WSNs) consist of a large number of sensor nodes which are capable of sensing different environmental phenomena and sending the collected data to the base station or Sink. Since sensor nodes are made of cheap components and are deployed in remote and uncontrolled environments, they are prone to failure; thus, maintaining a network with its proper functions even when und...
متن کاملImproving Energy-Efficient Target Coverage in Visual Sensor Networks
Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005